Density-based rough set model for hesitant node clustering in overlapping community detection
نویسندگان
چکیده
منابع مشابه
An Approach for hesitant Node Classification in Overlapping Community Detection
Overlapping community detection has recently drawn much attention in the field of social network analysis. In this paper, we propose a notion of hesitant node (HN) in network with overlapping community structure. An HN is a special kind of node that contacts with multiple communities but the communication is not frequent or even accidental, thus its community structure is implicit and its class...
متن کاملOverlapping Community Detection in Social Networks Based on Stochastic Simulation
Community detection is a task of fundamental importance in social network analysis. Community structures enable us to discover the hidden interactions among the network entities and summarize the network information that can be applied in many applied domains such as bioinformatics, finance, e-commerce and forensic science. There exist a variety of methods for community detection based on diffe...
متن کاملA Link Density Clustering Algorithm based on Automatically Selecting Density Peaks For Overlapping Community Detection
In this paper, we proposed a link density clustering method for overlapping community detection based on density peaks. We firstly use an extended cosine link distance metric to reflect the relationship of links. Then we introduce a clustering algorithm with fast search for solving the link clustering problem by density peaks with box plot strategy to determine the cluster centres automatically...
متن کاملA link clustering based overlapping community detection algorithm
Available online 14 May 2013 There is a surge of community detection study on complex network analysis in recent years, since communities often play important roles in network systems. However, many real networks have more complex overlapping community structures. This paper proposes a novel algorithm to discover overlapping communities. Different from conventional algorithms based on node clus...
متن کاملOverlapping Community Detection via Local Spectral Clustering
Large graphs arise in a number of contexts and understanding their structure and extracting information from them is an important research area. Early algorithms on mining communities have focused on the global structure, and often run in time functional to the size of the entire graph. Nowadays, as we often explore networks with billions of vertices and find communities of size hundreds, it is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Systems Engineering and Electronics
سال: 2014
ISSN: 1004-4132
DOI: 10.1109/jsee.2014.00125